An Equational Chase for Path-Conjunctive Queries, Constraints, and Views
نویسندگان
چکیده
We consider the class of path-conjunctive queries and constraints (dependencies) defined over complex values with dictionaries. This class includes the relational conjunctive queries and embedded dependencies, as well as many interesting examples of complex value and oodb queries and integrity constraints. We show that some important classical results on containment, dependency implication, and chasing extend and generalize to this class. Comments Postprint version. Published in Lecture Notes in Computer Science, International Conference on Database Theory (ICDT), Volume 1580, 1999, pages 39-57. Publisher URL: http://springerlink.metapress.com/link.asp?id=105633 This conference paper is available at ScholarlyCommons: http://repository.upenn.edu/db_research/40 ! #"$ % '&! ( )* ,+./ 0 1 '23 4 5 6 7 '28 9 :<;= '>? @BADC,EGFIH8J5KMLNF FOHDP QRFIS$T!FIHUHWV H XZYI[]\7^,_a`b[]ced#fhgBiN^,Y YM`ad7j]\lkhYI[mk n oZ^,pqkh_acars^,YIc*f g tuflr pMv ca^,_Rk Y w#xeYOgGfl_ar khcb[]flY yOz{[]^,Y z|^7n }7~l~ yOflv ca lh_aw yIca_a^,^,c,nqi$O[jmk w ^j]pqO[kOni I
منابع مشابه
Chase and Axioms for Pc Queries and Dependencies
1 Overview This report is the extended version of PT99] and while they are some overlapping parts (mainly the results) we don't repeat here some of the examples given in PT99], even though we frequently refer to them. The overview of this report is as follows. In section 2 we present some aspects of our internal framework, called CoDi 1. This is a language and equational theory that combines a ...
متن کاملΛ Φ I A Abstraction Mapping Implementation Mapping Q Q ’ Logical Schema Physical Schema
We present an optimization method and algorithm designed for three objectives: physical data independence, semantic optimization, and generalized tableau minimization. The method relies on generalized forms of chase and \backchase" with constraints (dependencies). By using dictionaries ((nite functions) in physical schemas we can capture with constraints useful access structures such as indexes...
متن کاملPhysical Data Independence, Constraints, and Optimization with Universal Plans
We present an optimization method and al gorithm designed for three objectives: physi cal data independence, semantic optimization, and generalized tableau minimization. The method relies on generalized forms of chase and "backchase" with constraints (dependen cies). By using dictionaries (finite functions) in physical schemas we can capture with con straints useful access structures such as in...
متن کاملA PC Chase
PC stands for path-conjunctive, the name of a class of queries and dependencies that we define over complex values with dictionaries. This class includes the relational conjunctive queries and embedded dependencies, as well as many interesting examples of complex value and oodb queries and integrity constraints. We show that some important classical results on containment, dependency implicatio...
متن کاملOn Chase Termination Beyond Stratification
We study the termination problem of the chase algorithm, a central tool in various database problems such as the constraint implication problem, Conjunctive Query optimization, rewriting queries using views, data exchange, and data integration. The basic idea of the chase is, given a database instance and a set of constraints as input, to fix constraint violations in the database instance. It i...
متن کامل